A Derandomization Using Min-Wise Independent Permutations
نویسندگان
چکیده
Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate min-wise independence allows similar uses, by presenting a derandomization of the RNC algorithm for approximate set cover due to S. Rajagopalan and V. Vazirani. We also discuss how to derandomize their set multi-cover and multi-set multi-cover algorithms in restricted cases. The multi-cover case leads us to discuss the concept of k-minima-wise independence, a natural counterpart to k-wise independence.
منابع مشابه
Constructing an Optimal Family of Min-Wise Independent Permutations∗
A family C of min-wise independent permutations is known to be a useful tool of indexing replicated documents on the Web. For any integer n > 0, a family C of permutations on [n] = {1, 2, . . . , n} is said to be min-wise independent if for any (nonempty) X ⊆ [n] and any x ∈ X, Pr(min{π(X)} = π(x)) = ‖X‖−1 when π is chosen uniformly at random from C, where ‖A‖ is the cardinality of a finite set...
متن کاملDerandomization of Families of Entropy-Preserving Functions
In probabilistic computations, random bits are viewed as a resource. An important goal is to consume as little of it as possible. We study functions, which decrease the number of random bits needed by an algorithms. Loss-less condensers take as input a low entropy source, and output a source, which is statistically close to a high entropy source. This closeness is referred to as the error of th...
متن کاملOn restricted min-wise independence of permutations
A family of permutations F ⊆ Sn with a probability distribution on it is called k-restricted min-wise independent if we have Pr[minπ(X) = π(x)] = 1 |X| for every subset X ⊆ [n] with |X | ≤ k, every x ∈ X , and π ∈ F chosen at random. We present a simple proof of a result of Norin: every such family has size at least ( n−1 ⌊ k−1 2 ⌋ ) . Some features of our method might be of independent interes...
متن کاملMin-Wise Independent Linear Permutations
A set of permutations F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have P (min{π(X)} = π(x)) = 1 |X| . This notion was introduced by Broder, Charikar, Frieze and Mitzenmacher and is motivated by an algorithm for filtering near-duplicate web documents. Linear permutations are an important class of permutations. Let p be a (large) prime a...
متن کاملAlmost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any sequence of k distinct elements to any sequence of k distinct elements with equal probability. Efficient constructions of k-wise independent permutations are known for k = 2 and k = 3 based on multiply transitive permutation groups but are unknown for k≥ 4. In fact, it is known that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 1 شماره
صفحات -
تاریخ انتشار 1998